An extended result of Kleitman and Saks concerning binary treesCHU YUNG-CHING.Discrete applied mathematics. 1985, Vol 10, Num 3, pp 255-259, issn 0166-218XArticle

Wiener indices of balanced binary treesBEREG, Sergey; HAO WANG.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26032-3, 3Vol, part II, 851-859Conference Paper

On rotations and the generation of binary treesLUCAS, J. M; ROELANTS VAN BARONAIGIEN, D; RUSKEY, F et al.Journal of algorithms (Print). 1993, Vol 15, Num 3, pp 343-366, issn 0196-6774Article

Un efamille d'opérations sur les arbres binaires = A family of operations on binary treesBLONDEL, V.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 321, Num 4, pp 491-494, issn 0764-4442Article

Loop-free algorithms for traversing binary treesFENNER, T. I; LOIZOU, G.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 1, pp 33-44, issn 0006-3835Article

KP line solitons and Tamari latticesDIMAKIS, Aristophanes; MÜLLER-HOISSEN, Folkert.Journal of physics. A, Mathematical and theoretical (Print). 2011, Vol 44, Num 2, issn 1751-8113, 025203.1-025203.49Article

The balanced binary tree technique on mesh-connected computersGIBBONS, A; ZIANI, R.Information processing letters. 1991, Vol 37, Num 2, pp 101-109, issn 0020-0190, 9 p.Article

An efficient upper bound of the rotation distance of binary treesPALLO, J.Information processing letters. 2000, Vol 73, Num 3-4, pp 87-92, issn 0020-0190Article

On the shrinkage exponent for read-once formulaeHASTAD, J; RAZBOROV, A; YAO, A et al.Theoretical computer science. 1995, Vol 141, Num 1-2, pp 269-282, issn 0304-3975Article

Exploiting local colour dependencies in binary tree predictive codingROBINSON, J. A.IEE conference publication. 2003, pp 37-40, issn 0537-9989, isbn 0-85296-757-8, 4 p.Conference Paper

On the generation of binary trees in A-orderAHRABIAN, H; NOWZARI-DALINI, A.International journal of computer mathematics. 1999, Vol 71, Num 3, pp 351-357, issn 0020-7160Article

Order-preserving, upward drawing of binary trees using fewer bendsSUNG KWON KIM.Discrete applied mathematics. 2004, Vol 143, Num 1-3, pp 318-323, issn 0166-218X, 6 p.Article

Separating points and coloring principlesWATSON, W. S.Canadian mathematical bulletin. 1984, Vol 27, Num 4, pp 398-404, issn 0008-4395Article

A simple bijection between a subclass of 2-binary trees and ternary treesPRODINGER, Helmut.Discrete mathematics. 2009, Vol 309, Num 4, pp 959-961, issn 0012-365X, 3 p.Article

Computing the quartet distance between trees of arbitrary degreeCHRISTIANSEN, Chris; MAILUND, Thomas; PEDERSEN, Christian N. S et al.Lecture notes in computer science. 2005, pp 77-88, issn 0302-9743, isbn 3-540-29008-7, 1Vol, 12 p.Conference Paper

Binary trees and uniform distribution of traffic cutbackLI, S.-Y. R.Journal of computer and system sciences (Print). 1986, Vol 32, Num 1, pp 1-14, issn 0022-0000Article

Generating binary trees using rotationsZERLING, D.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 3, pp 694-701, issn 0004-5411Article

A probabilistic analysis of the height of tries and of the complexity of triesortDEVROYE, L.Acta informatica. 1984, Vol 21, Num 3, pp 229-237, issn 0001-5903Article

New trie data structures which support very fast search operationsWILLARD, D. E.Journal of computer and system sciences (Print). 1984, Vol 28, Num 3, pp 379-394, issn 0022-0000Article

On binary tree encodementsGILLETT, W. D.Acta informatica. 1984, Vol 21, Num 2, pp 183-192, issn 0001-5903Article

Binary tree versus single level tree classification of white blood cellsLANDEWEERD, G. H; TIMMERS, T; GELSEMA, E. S et al.Pattern recognition. 1983, Vol 16, Num 6, pp 571-577, issn 0031-3203Article

The reduction of binary trees by means of an input-restricted dequeKEMP, R.R.A.I.R.O. Informatique théorique. 1983, Vol 17, Num 3, pp 249-284, issn 0399-0540Article

Binary tree encryption: Constructions and applicationsKATZ, Jonathan.Lecture notes in computer science. 2004, pp 1-11, issn 0302-9743, isbn 3-540-21376-7, 11 p.Conference Paper

On efficient entreeingsAMERINS, P. S; BAEZA-YATES, R. A; WOOD, D et al.Acta informatica. 1993, Vol 30, Num 3, pp 203-213, issn 0001-5903Article

Optimal alphabetic binary tree for a nonregular cost functionZHANG CUN-QUAN.Discrete applied mathematics. 1984, Vol 8, Num 3, pp 307-312, issn 0166-218XArticle